منابع مشابه
Level Planar Embedding in Linear Time
A level graph G = (V, E, φ) is a directed acyclic graph with a mapping φ : V → {1, 2, . . . , k}, k ≥ 1, that partitions the vertex set V as V = V 1∪V 2∪· · ·∪V , V j = φ−1(j), V i∩V j = ∅ for i 6= j, such that φ(v) ≥ φ(u) + 1 for each edge (u, v) ∈ E. The level planarity testing problem is to decide if G can be drawn in the plane such that for each level V , all v ∈ V i are drawn on the line l...
متن کاملRadial Level Planarity Testing and Embedding in Linear Time
A graph with an ordered k-partition of the vertices is radial level planar if there is a strictly outward drawing on k concentric levels without crossings. Radial level planarity extends level planarity, where the vertices are placed on k horizontal lines and the edges are routed strictly downwards without crossings. The extension is characterised by rings, which are certain level non-planar bi...
متن کاملA Linear Algorithm for Embedding Planar Graphs Using PQ-Trees
This paper presents a simple linear algorithm for embedding (or drawing) a planar graph in the plane. The algorithm is based on the “vertex-addition” algorithm of Lempel, Even, and Cederbaum (“Theory of Graphs,” Intl. Sympos. Rome, July 1966, pp. 21>232, Gordon & Breach, New York, 1967) for the planarity testing, and is a modification of Booth and Lueker’s (J. Comput. System Sci. 13 (1976), 335...
متن کاملEmbedding the Linear Structure of Planar Spaces into Projective Spaces
We show that every non-degenerate planar space with v points and π planes can be embedded as a linear space into PG(3, q) for some prime power q provided that 1000(π − v) ≤ v5/6.
متن کاملPlanar graph bipartization in linear time
For each constant k, we present a linear time algorithm that, given a planar graph G, either finds a minimum odd cycle vertex transversal in G or guarantees that there is no transversal of size at most k.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2002
ISSN: 1526-1719
DOI: 10.7155/jgaa.00045